A Weighted RRGMRES Implementation

نویسندگان

  • H. Zareamoghaddam
  • M. Nouri Kadijani
چکیده

GMRES is a popular iterative method for the solution of linear system of equations with an unsymmetric square matrix. Range restricted GMRES (RRGMRES) is one GMRES version proposed by Calvetti et al in 2000. In this paper, a weighted implementation for RRGMRES is proposed. Numerical results prove this weighted RRGMRES is better than RRGMRES.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-Scale Methods in Image Deblurring

We use the two-dimensional DCT to study several properties of reconstructed images computed by regularizing iterations, that is, Krylov subspace methods applied to discrete ill-posed problems. The regularization in these methods is obtained via the projection onto the associated Krylov subspace. We focus on CGLS/LSQR, GMRES, and RRGMRES, as well as MINRES and MR-II in the symmetric case.

متن کامل

بررسی رعایت و کاربرد استانداردهای ایمنی و بهداشت حرفه‌ای با استفاده از ماتریس ارزیابی عوامل داخلی و خارجی (SWOT)

Introduction: In today comparative markets, the organizations and companies will be success that adopt the standards related to their all works and services. By thechnalization and machinism, we are witnessed of higher rate of industrial accidents as well as economic losses in everyday activities. Therefore, the need for occupational safety and health standards is future required, otherwise, a ...

متن کامل

Noise Propagation in Regularizing Iterations for Image Deblurring

We use the two-dimensional discrete cosine transform to study how the noise from the data enters the reconstructed images computed by regularizing iterations, that is, Krylov subspace methods applied to discrete ill-posed problems. The regularization in these methods is obtained via the projection onto the associated Krylov subspace. We focus on CGLS/LSQR, GMRES, and RRGMRES, as well as MINRES ...

متن کامل

Drawing Weighted Directed Graph from It's Adjacency Matrix

This paper proposes an algorithm for buUdmg weighted directed graph,defmes the weighted directed relationship matrix of the graph,an d describes algorithm implementation using this matrix.Based on this algorithm ,an effective way for building an d drawing weighted directed graphs is presented,forming a foundation for visual implementation of the algorithm in the graph theory.

متن کامل

How Unfair can Weighted Fair Queuing be?

This paper presents a study carried out on a Weighted Fair Queuing implementation for Unix routers the WFQ implementation of the ALTQ project. It shows the WFQ/ALTQ weaknesses and explains why we cannot expect an interesting behavior from a system using such a

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013